A randomized fixed-parameter algorithm for the minimum quartet inconsistency problem
نویسندگان
چکیده
Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive integer k as the parameter, the parameterized Minimum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at most k quartet topologies. The best fixed-parameter algorithm devised so far for the parameterized MQI problem runs in time O(4n+ n). In this paper, we present a randomized fixed-parameter algorithm that runs in time O(3.47kn+n) with arbitrarily small constant error probability.
منابع مشابه
A fixed-parameter algorithm for minimum quartet inconsistency
Given n taxa, exactly one topology for every subset of four taxa, and a positive integer k (the parameter), the Minimum Quartet Inconsistency (MQI) problem is the question whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in only k quartet topologies. The more general problem where we are not necessarily given a topology for every subs...
متن کاملA polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
We present a polynomial time algorithm for the Minimum Quartet Inconsistency (MQI) problem when the number of quartet errors is O(n). This improves the previously best algorithmic result saying that if the number of quartet errors is at most (n− 3)/2 then the MQI problem can be solved in polynomial time. © 2006 Elsevier B.V. All rights reserved.
متن کاملEvaluating an Algorithm for Parameterized Minimum Quartet Inconsistency
MINIMUM QUARTET INCONSISTENCY (MQI) Input: A set S of n taxa and a set QS of quartet topologies such that there is exactly one topology for every quartet set corresponding to S, and an integer k. Question: Is there an evolutionary tree T where the leaves are bijectively labeled by the elements from S such that the set of quartet topologies induced by T differs from QS in at most k quartet topol...
متن کاملOn the Weighted Quartet Consensus Problem
In phylogenetics, the consensus problem consists in summarizing a set of phylogenetic trees that all classify the same set of species into a single tree. Several definitions of consensus exist in the literature; in this paper we focus on the Weighted Quartet Consensus problem, a problem with unknown complexity status so far. Here we prove that the Weighted Quartet Consensus problem is NP-hard a...
متن کاملApproximating minimum quartet inconsistency (abstract)
A fundamental problem in computational biology which has been widely studied in the last decades is the reconstruction of evolutionary trees from biological data. Unfortunately, almost all its known formulations are NPhard. The compelling need for having efficient computational tools to solve this biological problem has brought a lot of attention to the analysis of the quartet paradigm for infe...
متن کامل